منابع مشابه
On the fundamental matrix of the inverse of a polynomial matrix and applications
The aim of this work is twofold : a) it uses the fundamental matrix of the resolvent of a regular pencil in order to provide an algorithm for the computation of the fundamental matrix of the resolvent of a polynomial matrix, and b) it proposes a closed formula for the forward, backward and symmetric solution of an AutoRegressive Moving Average (ARMA). This closed formula is represented in term...
متن کاملextensions of some polynomial inequalities to the polar derivative
توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی
15 صفحه اولStraight-line computation of the polynomial matrix inverse
We present an inversion algorithm for nonsingular n × n matrices whose entries are degree d polynomials over a field. The algorithm is deterministic and requires O (̃nd) field operations for a generic input. The “soft Oh” notation O ̃indicates some missing log(nd) factors. The polynomial matrix inverse can thus be computed by a straight-line program whose size is — asymptotically and up to logari...
متن کاملAlgebraic adjoint of the polynomials-polynomial matrix multiplication
This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field
متن کاملOn the distance from a matrix polynomial to matrix polynomials with two prescribed eigenvalues
Consider an n × <span style="fon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1977
ISSN: 0024-3795
DOI: 10.1016/0024-3795(77)90009-x